Interactive Secure Function Computation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Interactive Secure Multiparty Computation

We introduce and study the notion of non-interactive secure multiparty computation (NIMPC). An NIMPC protocol for a function f(x1, . . . , xn) is specified by a joint probability distribution R = (R1, . . . , Rn) and local encoding functions Enci(xi, ri), 1 ≤ i ≤ n. Given correlated randomness (r1, . . . , rn) ∈R R, each party Pi, using its input xi and its randomness ri, computes the message m...

متن کامل

Efficient Non-interactive Secure Computation

Suppose that a receiver R wishes to publish an encryption of her secret input x so that every sender S, holding an input y, can reveal f(x, y) to R by sending her a single message. This should be done while simultaneously protecting the secrecy of y against a corrupted R and preventing a corrupted S from having an unfair influence on the output of R beyond what is allowed by f . When the partie...

متن کامل

Distributed Source Coding for Interactive Function Computation

In networked systems where distributed inferencing and control needs to be performed, the raw-data generated at different nodes needs to be transformed and combined in a number of ways to extract actionable information. This requires performing distributed computations on the rawdata. A pure data-transfer solution approach would advocate first reliably reproducing the rawdata at decision-making...

متن کامل

Non-Interactive Secure Computation Based on Cut-and-Choose

In recent years, secure two-party computation (2PC) has been demonstrated to be feasible in practice. However, all efficient general-computation 2PC protocols require multiple rounds of interaction between the two players. This property restricts 2PC to be only relevant to scenarios where both players can be simultaneously online, and where communication latency is not an issue. This work consi...

متن کامل

Secure Computation

Suppose your university department is about to make a job offer, and a friend tells you that their department is also about to make an offer. Are you entering into a bidding war, or are the two departments interested in different people? You open your mouth to ask, “Are you making an offer to X?” then shut it, imagining an answer of, “Actually, we were interested in someone else, but now that y...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2020

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2020.2980789